On Some Conjectures Concerning Stern's Sequence and Its Twist
نویسندگان
چکیده
منابع مشابه
On Some Conjectures Concerning Critical Independent Sets of a Graph
Let G be a simple graph with vertex set V (G). A set S ⊆ V (G) is independent if no two vertices from S are adjacent. For X ⊆ V (G), the difference of X is d(X) = |X| − |N(X)| and an independent set A is critical if d(A) = max{d(X) : X ⊆ V (G) is an independent set} (possibly A = ∅). Let nucleus(G) and diadem(G) be the intersection and union, respectively, of all maximum size critical independe...
متن کاملConjectures concerning Schizophrenia
Editorial note: This chapter came to be written under different circumstances than the other chapters, as it is a slightly modified version of a personal letter from Professor Meehl to myself. Meehl was writing in response to an invited commentary that I had written for the Journal of Personality Disorders, concerning Meehl’s (1990c) important theory paper in that journal. My commentary express...
متن کاملOn Kalai's Conjectures Concerning Centrally Symmetric Polytopes
In 1989 Kalai stated the three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture,A, became known as the “3-conjecture”. It is well-known that the three conjectures hold in dimensions d ≤ 3. We show that in dimension 4 only conjectures A and B are valid, while conjecture C fails. Furthermore, we show that both conje...
متن کاملOn Two Conjectures concerning Convex Curves
In this paper we recall two basic conjectures on the developables of convex projective curves, prove one of them and disprove the other in the first nontrivial case of curves in RP . Namely, we show that i) the tangent developable of any convex curve in RP 3 has degree 4 and ii) construct an example of 4 tangent lines to a convex curve in RP 3 such that no real line intersects all four of them....
متن کاملSome conjectures on codes
Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations with factorizations of cyclic groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Integers
سال: 2011
ISSN: 1867-0652
DOI: 10.1515/integ.2011.059